منابع مشابه
Wide-Sense Nonblocking WDM Cross-Connects
We consider the problem of minimizing the number of wavelength interchangers in the design of wide-sense nonblocking crossconnects for wavelength division multiplexed (WDM) optical networks. The problem is modeled as a graph theoretic problem that we call dynamic edge coloring. In dynamic edge coloring the nodes of a graph are fixed but edges appear and disappear, and must be colored at the tim...
متن کاملStrictly Nonblocking -Cast Photonic Networks
The multicast capability and crosstalk issue need to be deliberately considered in the design of future high performance photonic switching networks. In this paper, we focus on the photonic switching networks built on the banyan-based architecture and directional coupler technology. We explore the capability of these networks to support general -cast traffic, which covers the unicast traffic an...
متن کاملWDM Split Cross-connects and 3-stage Clos Networks
In this paper, we first show that a wavelength division multiplexed (WDM) split crossconnect is strictly, wide-sense, or rearrangeably non-blocking if and only if a corresponding 3-stage Clos network is strictly, wide-sense or rearrangeably non-blocking. This observation implies known results on strictly non-blocking WDM split cross-connects and gives rise to new results on wide-sense and rearr...
متن کاملNonblocking WDM Multicast Switching Networks
ÐWith ever increasing demands on bandwidth from emerging bandwidth-intensive applications, such as video conferencing, E-commerce, and video-on-demand services, there has been an acute need for very high bandwidth transport network facilities. Optical networks are a promising candidate for this type of applications. At the same time, many bandwidth-intensive applications require multicast servi...
متن کاملChoosing the best logk(N, m, P) strictly nonblocking networks
We extend the log 2 (N; m; P ) network proposed by Shyy and Lea to base k. We give a unifying proof (instead of three separate cases as done by Shyy and Lea) for the condition of being strictly nonblocking, and a simpler expression of the result. We compare the number of crosspoints for log k (N; m; p) over various k.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2005
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539703434255